Learning Voting Trees
نویسندگان
چکیده
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. We show that, while in general a learning algorithm would require an exponential number of samples, if the number of leaves is polynomial in the size of the set of alternatives then a polynomial training set suffices. We apply these results in an emerging theory: automated design of voting rules by learning.
منابع مشابه
Development of Discriminant Analysis and Majority-Voting Based Credit Risk Assessment Classifier
This article presents a research on a method for credit risk evaluation combining expert majority-based ensemble voting scheme together with discriminant analysis as basis for expert formation and popular machine learning techniques for classification, such as decision trees, rulebased inducers and neural networks. Both single expert and multiple expert evaluations were applied as basis for for...
متن کاملAn Experimental Study of Methods Combining Multiple Classifiers - Diversified both by Feature Selection and Bootstrap Sampling
Ensemble approaches are learning algorithms that construct a set of classifiers and then classify new instances by combining their predictions. These approaches can outperform single classifiers on wide range of classification problems. In this paper we proposed an extension of the bagging classifier integrating it with feature subset selection. Moreover, we examined the usage of other methods ...
متن کاملLearning with Ensembles of Randomized Trees : New Insights
Ensemble of randomized trees such as Random Forests are among the most popular tools used in machine learning learning and data mining. Such algorithms work by introducing randomness in the induction of several decision trees before employing a voting scheme to give a prediction for unseen instances. In this paper, randomized trees ensembles are studied in the point of view of the basis functio...
متن کاملGeneralization Capability of Homogeneous Voting Classifier Based on Partially Replicated Data
The generalization error is one of the most important features taken into account in performance evaluation and verification of any classifier. We propose a voting system based on homogenous base classifiers (HVC) which ensures a better generalization capability than any of its components. The principle of this idea consists in the differentiation of a learning data set for each base classifier...
متن کاملDifferentially- and non-differentially-private random decision trees
We consider supervised learning with random decision trees, where the tree construction is completely random. The method was used as a heuristic working well in practice despite the simplicity of the setting, but with almost no theoretical guarantees. The goal of this paper is to shed new light on the entire paradigm. We provide strong theoretical guarantees regarding learning with random decis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007